Recognizability of the Simple $K_n$-Groups ($n=3, 4$)

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

2-recognizability of the simple groups $B_n(3)$ and $C_n(3)$ by prime graph

Let $G$ be a finite group and let $GK(G)$ be the prime graph of $G$. We assume that $ngeqslant 5 $ is an odd number. In this paper, we show that the simple groups $B_n(3)$ and $C_n(3)$ are 2-recognizable by their prime graphs. As consequences of the result, the characterizability of the groups $B_n(3)$ and $C_n(3)$ by their spectra and by the set of orders of maximal abelian subgroups are ...

متن کامل

2-recognizability of the simple groups $b_n(3)$ and $c_n(3)$ by prime graph

let $g$ be a finite group and let $gk(g)$ be the prime graph of $g$. we assume that $ngeqslant 5 $ is an odd number. in this paper, we show that the simple groups $b_n(3)$ and $c_n(3)$ are 2-recognizable by their prime graphs. as consequences of the result, the characterizability of the groups $b_n(3)$ and $c_n(3)$ by their spectra and by the set of orders of maximal abelian subgroups are obtai...

متن کامل

finite simple groups which are the products of symmetric or alternating groups with $l_{3}(4)$

in this paper‎, ‎we determine the simple groups $g=ab$‎, ‎where $b$ is isomorphic to $l_{3}(4)$ and $a$ isomorphic to an alternating or a symmetric group on $ngeq5$‎, ‎letters‎.

متن کامل

OD-characterization of Almost Simple Groups Related to displaystyle D4(4)

Let $G$ be a finite group and $pi_{e}(G)$ be the set of orders of all elements in $G$. The set $pi_{e}(G)$ determines the prime graph (or Grunberg-Kegel graph) $Gamma(G)$ whose vertex set is $pi(G)$, the set of primes dividing the order of $G$, and two vertices $p$ and $q$ are adjacent if and only if $pqinpi_{e}(G)$. The degree $deg(p)$ of a vertex $pin pi(G)$, is the number of edges incident...

متن کامل

Frec Delivrable 4: Recognizability for Λ-terms

This document constitutes the delivrable 4 of the ANR project FREC. It describes the foundations of recognizability in the simply typed λ-calculus. It is divided in two parts: 1. the first part describes the notion, shows how it relates to the notions of rec-ognizability in free algebras and in free monoids. It also gives some examples of applications in the setting of λ-calculus by providing e...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Missouri Journal of Mathematical Sciences

سال: 2008

ISSN: 0899-6180

DOI: 10.35834/mjms/1316032832